Spectral properties of trinomial trees

نویسنده

  • A. Mijatović
چکیده

In this paper, we prove that the probability kernel of a random walk on a trinomial tree converges to the density of a Brownian motion with drift at the rate O(h), where h is the distance between the nodes of the tree. We also show that this convergence estimate is optimal in which the density of the random walk cannot converge at a faster rate. The proof is based on an application of spectral theory to the transition density of the random walk. This yields an integral representation of the discrete probability kernel that allows us to determine the convergence rate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Trinomial Trees for One-Factor Short Rate Models∗

In this article we discuss the implementation of general one-factor short rate models with a trinomial tree. Taking the Hull-White model as a starting point, our contribution is threefold. First, we show how trees can be spanned using a set of general branching processes. Secondly, we improve Hull-White’s procedure to calibrate the tree to bond prices by a much more efficient approach. This app...

متن کامل

Efficient Calibration of Trinomial Trees for One-Factor Short Rate Models

In this paper we propose a computationally efficient implementation of general one factor short rate models with a trinomial tree. We improve the Hull–White’s procedure to calibrate the tree to bond prices by circumventing the forward rate induction and numerical root search algorithms. Our calibration procedure is based on forward measure changes and is as general as the Hull–White procedure, ...

متن کامل

Lexicographical ordering by spectral moments of trees with a given bipartition

 Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this‎ ‎paper‎. ‎For two given positive integers $p$ and $q$ with $pleqslant q$‎, ‎we denote $mathscr{T}_n^{p‎, ‎q}={T‎: ‎T$ is a tree of order $n$ with a $(p‎, ‎q)$-bipartition}‎. Furthermore, ‎the last four trees‎, ‎in the $S$-order‎, ‎among $mathscr{T}_n^{p‎, ‎q},(4leqslant pleqslant q)$ are characterized‎.

متن کامل

The (exponential) Bipartitional Polynomials and Polynomial Sequences of Trinomial Type: Part Ii

In a previous paper we investigated the (exponential) bipartitional polynomials involving polynomial sequences of trinomial type. Our aim is to give properties of bipartitional polynomials related to the derivatives of polynomial sequences of trinomial type. Furthermore, we deduce identities involving Bell polynomials.

متن کامل

On the Relation Between Binomial and Trinomial Option Pricing Models

This paper shows that the binomial option pricing model, suitably parameterized, is a special case of the explicit finite difference method. To prepare for writing the sequel volume of my new book Derivatives: A PowerPlus Picture Book, I recently reviewed the work on trinomial option pricing since Boyle’s 1988 JFQA paper. I found myself attracted to the Kamrad and Ritchken (1991) trinomial mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008